ar X iv : m at h / 04 06 13 4 v 1 [ m at h . FA ] 8 J un 2 00 4 FRAMES , GRAPHS AND ERASURES
نویسنده
چکیده
Two-uniform frames and their use for the coding of vectors are the main subject of this paper. These frames are known to be optimal for handling up to two erasures, in the sense that they minimize the largest possible error when up to two frame coefficients are set to zero. Here, we consider various numerical measures for the reconstruction error associated with a frame when an arbitrary number of the frame coefficients of a vector are lost. We derive general error bounds for two-uniform frames when more than two erasures occur and apply these to concrete examples. We show that among the 227 known equivalence classes of two-uniform (36,15)-frames arising from Hadamard matrices, there are 5 that give smallest error bounds for up to 8 erasures.
منابع مشابه
ar X iv : m at h / 04 06 13 4 v 2 [ m at h . FA ] 8 S ep 2 00 4 FRAMES , GRAPHS AND ERASURES
Two-uniform frames and their use for the coding of vectors are the main subject of this paper. These frames are known to be optimal for handling up to two erasures, in the sense that they minimize the largest possible error when up to two frame coefficients are set to zero. Here, we consider various numerical measures for the reconstruction error associated with a frame when an arbitrary number...
متن کاملm at h . FA ] 1 1 M ar 2 00 5 FRAMES , GRAPHS AND ERASURES BERNHARD
Two-uniform frames and their use for the coding of vectors are the main subject of this paper. These frames are known to be optimal for handling up to two erasures, in the sense that they minimize the largest possible error when up to two frame coefficients are set to zero. Here, we consider various numerical measures for the reconstruction error associated with a frame when an arbitrary number...
متن کاملFrames, Graphs and Erasures
Two-uniform frames and their use for the coding of vectors are the main subject of this paper. These frames are known to be optimal for handling up to two erasures, in the sense that they minimize the largest possible error when up to two frame coefficients are set to zero. Here, we consider various numerical measures for the reconstruction error associated with a frame when an arbitrary number...
متن کاملA Rate-Optimal Construction of Codes with Sequential Recovery with Low Block Length
An erasure code is said to be a code with sequential recovery with parameters r and t, if for any s ≤ t erased code symbols, there is an s-step recovery process in which at each step we recover exactly one erased code symbol by contacting at most r other code symbols. In earlier work by the same authors, presented at ISIT 2017, we had given a construction for binary codes with sequential recove...
متن کاملConstruction of k-angle tight frames
Frames have become standard tools in signal processing due to their robustness to transmission errors and their resilience to noise. Equiangular tight frames (ETFs) are particularly useful and have been shown to be optimal for transmission under a certain number of erasures. Unfortunately, ETFs do not exist in many cases and are hard to construct when they do exist. However, it is known that an...
متن کامل